Kernel-check the Section 9 matching-restriction product bound - #34
Open
SamPetkov wants to merge 4 commits into
Open
Kernel-check the Section 9 matching-restriction product bound#34SamPetkov wants to merge 4 commits into
SamPetkov wants to merge 4 commits into
Conversation
This was referenced Jul 24, 2026
Owner
Author
|
Validation update: the corrected focused workflow, the full Lean 4.31 The earlier focused-workflow failure was CI plumbing only: it attempted direct compilation before building local dependencies. The theorem source did not change in that repair. PR #35 is now stacked on this green head and integrates the finite product theorem with the literal attachment numerator and analytic envelope. |
SamPetkov
marked this pull request as ready for review
July 25, 2026 05:03
This was referenced Jul 25, 2026
SamPetkov
added a commit
that referenced
this pull request
Jul 25, 2026
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Summary
This PR translates the finite combinatorial core of PR #30 into Lean.
For a finite even bipartite edge set and an exposed matching
M, deletingMis injective. Consequently the weighted even-family sum is bounded directly by the full subset product on the cells outsideM, without a cycle decomposition.Files
625/formalization/Erdos625/Section9MatchingRestrictionProduct.lean625/formalization/MATCHING_RESTRICTION_PRODUCT_AUDIT.md.github/workflows/erdos625-matching-restriction-product.ymlThe module proves:
sdiff_matching_injective_on_bipartiteEvenEdgeSets— restrictionF ↦ F \ Mis injective on the finite even-edge family;weighted_evenSubgraph_ennreal_matching_product—residualCappedEvenFixedFSum_le_lambdaProduct_mul_matchingProduct— the existing fixed-Faggregation is bounded by the local-lambda product times the direct outside-matching product.Why
The current formalization already contains the incidence-matrix parity encoding, matching-restriction uniqueness for supported even matrices, and the fixed-
Fthreshold aggregation. This module composes those accepted finite ingredients into the simpler endpoint proposed in PR #30.For this particular finite algebraic bound it removes the need for a simple-cycle decomposition, residual-walk enumeration, or marked matching-cycle encoding. Those independently useful modules remain unchanged.
Validation gates
The module has direct
#print axiomschecks. A focused workflow:sorry,admit, project-defined axioms/constants, andunsafedeclarations;-DwarningAsError=true.The full repository Lean workflow also builds the formalization library with
--wfail.Scope boundary
This PR does not yet:
Fsum with the tagged actual attachment expectation;O(U^2 + U^4/m_0)envelope;Erdos625Statement.The audit file records the exact remaining bridges.